Continuous projection for fast L 1 reconstruction
نویسندگان
چکیده
منابع مشابه
Supplemental Materialorontinuous Projection for Fast L1 Reconstruction
In this document we provide a detailed description of the methods and parameters used for the generation of the models in the paper and the video. Model Camel Daratech Gargoyle Garg. small scans 18 16 16 16 resolution 245 300 300 150 noise 0.2 0.1 0.1 0.1 smoothing 0.5 0.1 0.1 0.1 laser FOV 8 4.5 4.5 4.5 peak mag. 0.05 0.1 0.1 0.1 registration 0 1.0 1.0 1.0 Table 1: Virtual scan parameters used...
متن کاملFast alternating projection methods for constrained tomographic reconstruction
The alternating projection algorithms are easy to implement and effective for large-scale complex optimization problems, such as constrained reconstruction of X-ray computed tomography (CT). A typical method is to use projection onto convex sets (POCS) for data fidelity, nonnegative constraints combined with total variation (TV) minimization (so called TV-POCS) for sparse-view CT reconstruction...
متن کاملA Fast and Efficient Projection-Based Approach for Surface Reconstruction
We present a fast, memory efficient, linear time algorithm that generates a manifold triangular mesh passing through a set of unorganized points . Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident fac...
متن کاملIterative projection reconstruction for fast and efficient image upsampling
With the development of ultra-high-resolution display devices, the visual perception of fine texture details is becoming increasingly important. Traditional image upsampling methods suffer from either loss of highfrequency texture details or very high time cost. In this paper, we propose an iterative projection reconstruction (IPR) method for fast and efficient image upsampling. The proposed me...
متن کاملA Fast and Efficient Projection-Based Approach for Surface Reconstruction
We present a fast and memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P ‰ R3. Nothing is assumed about the geometry, topology or presence of boundaries in the data set except that P is sampled from a real manifold surface. The speed of our algorithm is derived from a projection-based approach we use to determine the incident fac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2014
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2601097.2601172